Real-expansive flows and topological dimension
نویسندگان
چکیده
منابع مشابه
Real Rank and Topological Dimension of Higher Rank Graph Algebras
We study dimension theory for the C∗-algebras of row-finite k-graphs with no sources. We establish that strong aperiodicity—the higher-rank analogue of condition (K)—for a k-graph is necessary and sufficient for the associated C∗-algebra to have topological dimension zero. We prove that a purely infinite 2-graph algebra has real-rank zero if and only if it has topological dimension zero and sat...
متن کاملC-stably Expansive Sets for Flows
Let X be a C1 vector field on a closed C∞ manifold M . We introduce the concept of C1 stable expansivity for compact Xt-invariant set, and use a flow-version of Mane’s results (Lemma II.3 in ”Mane, R. An ergodic closing lemma. Ann. of Math. (2) 116 (1982), no. 3, 503–540”) on uniformly hyperbolic families of periodic linear differential equations in order to get the hyperbolicity for the C1 sta...
متن کاملTopological Games and Covering Dimension
We consider a natural way of extending the Lebesgue covering dimension to various classes of infinite dimensional separable metric spaces. All spaces in this paper are assumed to be separable metric spaces. Infinite games can be used in a natural way to define ordinal valued functions on the class of separable metric spaces. One of our examples of such an ordinal function coincides in any finit...
متن کاملTopological diagonalizations and Hausdorff dimension
The Hausdorff dimension of a product X × Y can be strictly greater than that of Y , even when the Hausdorff dimension of X is zero. But when X is countable, the Hausdorff dimensions of Y and X × Y are the same. Diagonalizations of covers define a natural hierarchy of properties which are weaker than “being countable” and stronger than “having Hausdorff dimension zero”. Fremlin asked whether it ...
متن کاملDimension-Extended Topological Relationships
analysis. In Proc. 21st Int. Conf. on Machine Learning, 2004. 5. Ding C., He X., Zha H., and Simon H. Unsupervised learning: self-aggregation in scaled principal component space. Principles of Data Mining and Knowledge Discovery, 6th European Conf., 2002, pp. 112–124. 6. Fiedler M. Algebraic connectivity of graphs. Czech. Math. J., 23:298–305, 1973. 7. Hagen M. and Kahng A.B. New spectral metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 1981
ISSN: 0143-3857,1469-4417
DOI: 10.1017/s0143385700009214